On multiple output bent functions

a r t i c l e i n f o a b s t r a c t Keywords: Cryptography Boolean functions Bent functions Multiple output Monomial trace functions In this article we investigate the possibilities of obtaining multiple output bent functions from certain power polynomials over finite fields. So far multiple output bent functions F : GF(2) n → GF(2) m (where n is even and m n/2), for any particular class of Boolean bent functions, has been generated using a suitable collection of m Boolean bent functions so that any nonzero linear combination of these functions is again bent. Here, we take a different approach by deriving these functions directly from the known classes of so-called monomial trace bent functions. We derive a sufficient condition for a bent Boolean function of the form f (x) = Tr n 1 (λx d) so that the associated mapping F (x) = Tr n m (λx d), where F : GF(2) n → GF(2) m , is a multiple output bent function. We consider all the main cases of monomial trace bent functions and specify the restrictions on λ and m that yield multiple output bent functions F (x) = Tr n m (λx d). Interestingly enough, in one particular case when n = 4r, d = (2 r + 1) 2 , a multiple bent function F (x) = Tr n 2r (ax d) could not be obtained by considering a collection of 2r Boolean bent functions of the form f i (x) = Tr n 1 (λ i x d) for some suitable coefficients λ i ∈ GF(2 n).